Accelerating Multipattern Matching on Compressed HTTP Traffic
نویسندگان
چکیده
منابع مشابه
Detecting Bot Networks Based On HTTP And TLS Traffic Analysis
Abstract— Bot networks are a serious threat to cyber security, whose destructive behavior affects network performance directly. Detecting of infected HTTP communications is a big challenge because infected HTTP connections are clearly merged with other types of HTTP traffic. Cybercriminals prefer to use the web as a communication environment to launch application layer attacks and secretly enga...
متن کاملAccelerating SENSE using compressed sensing.
Both parallel MRI and compressed sensing (CS) are emerging techniques to accelerate conventional MRI by reducing the number of acquired data. The combination of parallel MRI and CS for further acceleration is of great interest. In this paper, we propose a novel method to combine sensitivity encoding (SENSE), one of the standard methods for parallel MRI, and compressed sensing for rapid MR imagi...
متن کاملDirect Pattern Matching on Compressed Text
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any known sequential pattern matching algorithm. Approximate search can also be done ee-ciently without any decoding. The compression scheme uses a semi-static word-based modeling and a Huu-man coding where the coding alpha...
متن کاملCompressed Subspace Matching on the Continuum
We consider the general problem of matching a subspace to a signal in R that has been observed indirectly (compressed) through a random projection. We are interested in the case where the collection of K-dimensional subspaces is continuously parameterized, i.e. naturally indexed by an interval from the real line, or more generally a region of R. Our main results show that if the dimension of th...
متن کاملCompressed Matching in Dictionaries
The problem of compressed pattern matching, which has recently been treated in many papers dealing with free text, is extended to structured files, specifically to dictionaries, which appear in any full-text retrieval system. The prefix-omission method is combined with Huffman coding and a new variant based on Fibonacci codes is presented. Experimental results suggest that the new methods are o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2012
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2011.2172456